A Linear Algebraic Approach to Subfield Subcodes of GRS Codes
نویسندگان
چکیده
The problem of finding subfield subcodes of generalized Reed–Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose– Chaudhuri–Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for finding nested subfield subcodes with increasing design distance.
منابع مشابه
The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is static, the appropriate length can be obtained by an RS code by shortening or puncturing. Generalized Reed-Solomon (GRS) codes are a generalization of RS codes...
متن کاملA class of linear codes with good parameters from algebraic curves
A class of linear codes with good parameters is constructed in this correspondence. It turns out that linear codes of this class are subcodes of the subfield subcodes of Goppa’s geometry codes. In particular, we find 61 improvements on Brouwer’s table [1] based on our codes.
متن کاملCodes and the Cartier Operator
In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the Cartier operator. This new class of codes can be regarded as a natural geometric generalisation of classical Goppa codes. In particular, we prove that a well-kn...
متن کاملGeneralized subspace subcodes with application in cryptology
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constr...
متن کاملNew binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...
متن کامل